Using PMCMC in EM algorithm for stochastic mixed models: theoretical and practical issues
نویسندگان
چکیده
Biological processes measured repeatedly among a series of individuals are standardly analyzed by mixed models. Recently, stochastic processes have been introduced to model the variability along time for each subject. Although the likelihood of these stochastic mixed models is intractable, various estimation methods have been proposed when the latent stochastic process is a discrete time finite state Markov chain. This is not the case when the hidden stochastic process is a continuous time process with non finite state space. This paper focuses on mixed models defined by parametric Stochastic Differential Equations (SDEs). We propose to use Particle MCMC algorithm for the maximum likelihood estimation of mixed SDE models, by combining it with SAEM algorithm. Theoretical and numerical convergence properties are discussed. Two simulated examples, an Ornstein-Uhlenbeck process and a time-inhomogeneous SDE with stochastic volatility, illustrate this estimator convergence, including the volatility parameter which is known to be hard to estimate.
منابع مشابه
EM algorithm coupled with particle filter for maximum likelihood parameter estimation of stochastic differential mixed-effects models
Biological processes measured repeatedly among a series of individuals are standardly analyzed by mixed models. These biological processes can be adequately modeled by parametric Stochastic Differential Equations (SDEs). We focus on the parametric maximum likelihood estimation of this mixed-effects model defined by SDE. As the likelihood is not explicit, we propose a stochastic version of the E...
متن کاملParticle MCMC algorithms and architectures for accelerating inference in state-space models☆
Particle Markov Chain Monte Carlo (pMCMC) is a stochastic algorithm designed to generate samples from a probability distribution, when the density of the distribution does not admit a closed form expression. pMCMC is most commonly used to sample from the Bayesian posterior distribution in State-Space Models (SSMs), a class of probabilistic models used in numerous scientific applications. Nevert...
متن کاملACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem
The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...
متن کاملOPTIMIZATION OF A PRODUCTION LOT SIZING PROBLEM WITH QUANTITY DISCOUNT
Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by many researchers. Considering the quantity discount in purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In this paper, stochastic dyn...
متن کاملAn Analytical Model for Predicting the Convergence Behavior of the Least Mean Mixed-Norm (LMMN) Algorithm
The Least Mean Mixed-Norm (LMMN) algorithm is a stochastic gradient-based algorithm whose objective is to minimum a combination of the cost functions of the Least Mean Square (LMS) and Least Mean Fourth (LMF) algorithms. This algorithm has inherited many properties and advantages of the LMS and LMF algorithms and mitigated their weaknesses in some ways. The main issue of the LMMN algorithm is t...
متن کامل